翻訳と辞書 Words near each other ・ Binary cyclic group ・ Binary data ・ Binary decision ・ Binary decision diagram ・ Binary decoder ・ Binary delta compression ・ Binary distribution ・ Binary distribution (disambiguation) ・ Binary Divide ・ Binary Domain ・ Binary economics ・ Binary entropy function ・ Binary erasure channel ・ Binary ethylenimine ・ Binary explosive ・ Binary expression tree ・ Binary file ・ Binary File Descriptor library ・ Binary Finary ・ Binary form ・ Binary form (disambiguation) ・ Binary Format Description language ・ Binary function ・ Binary game ・ Binary GCD algorithm ・ Binary Golay code ・ Binary Goppa code ・ Binary Hammer ・ Binary hardening ・ Binary heap Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Binary expression tree ： ウィキペディア英語版 Binary expression tree A binary expression tree is a specific kind of a binary tree used to represent expressions. Two common types of expressions that a binary expression tree can represent are algebraic and boolean. These trees can represent expressions that contain both unary and binary operators.〔 Each node of a binary tree, and hence of a binary expression tree, has zero, one, or two children. This restricted structure simplifies the processing of expression trees. == Overview == The leaves of a binary expression tree are operands, such as constants or variable names, and the other nodes contain operators. These particular trees happen to be binary, because all of the operations are binary, and although this is the simplest case, it is possible for nodes to have more than two children. It is also possible for a node to have only one child, as is the case with the unary minus operator. An expression tree, ''T'', can be evaluated by applying the operator at the root to the values obtained by recursively evaluating the left and right subtrees.〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Binary expression tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.